Matrix-Based Approaches for Updating Approximations in Multigranulation Rough Set While Adding and Deleting Attributes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pessimistic rough set based decisions: A multigranulation fusion strategy

Multigranulation rough sets (MGRS) is one of desirable directions in rough set theory, in which lower/upper approximations are approximated by granular structures induced by multiple binary relations. It provides a new perspective for decision making analysis based on rough set theory. In decision making analysis, people often adopt the decision strategy ‘‘Seeking common ground while eliminatin...

متن کامل

Approximation reductions in an incomplete variable precision multigranulation rough set

This paper deals with approaches to the granular space reductions in the variable precision multigranulation rough set model. The main objective of this study is to extend four kinds of the granular space reductions called a tolerance relations optimistic multigranulation  ower approximation distribution reduction, a tolerance relations optimistic multigranulation  upper approximation distrib...

متن کامل

Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set

Dominance-based Rough Sets Approach (DRSA) is a generalized model of the classical Rough Sets Theory (RST) which may handle information with preference-ordered attribute domain. The attribute set in the information system may evolve over time. Approximations of DRSA used to induce decision rules need updating for knowledge discovery and other related tasks. We firstly introduce a kind of domina...

متن کامل

Probabilistic rough set approximations

Probabilistic approaches have been applied to the theory of rough set in several forms, including decision-theoretic analysis, variable precision analysis, and information-theoretic analysis. Based on rough membership functions and rough inclusion functions, we revisit probabilistic rough set approximation operators and present a critical review of existing studies. Intuitively, they are define...

متن کامل

Incremental updating approximations in probabilistic rough sets under the variation of attributes

The attribute set in an information system evolves in time when new information arrives. Both lower and upper approximations of a concept will change dynamically when attributes vary. Inspired by the former incremental algorithm in Pawlak rough sets, this paper focuses on new strategies of dynamically updating approximations in probabilistic rough sets and investigates four propositions of upda...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Intelligence Systems

سال: 2019

ISSN: 1875-6883

DOI: 10.2991/ijcis.d.190718.001